#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long long r[200005], c[200005];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> r[i] >> c[i];
  }
  sort(r + 1, r + 1 + n);
  sort(c + 1, c + 1 + n);
 
  ll x = (r[n] - r[1] + 1) / 2; // 向上取整
  ll y = (c[n] - c[1] + 1) / 2;
  cout << max(x, y) << endl;

  return 0;
}